Domination, Packing and Excluded Minors
نویسندگان
چکیده
Let γ(G) be the domination number of a graph G, and let αk(G) be the maximum number of vertices in G, no two of which are at distance ≤ k in G. It is easy to see that γ(G) ≥ α2(G). In this note it is proved that γ(G) is bounded from above by a linear function in α2(G) if G has no large complete bipartite graph minors. Extensions to other parameters αk(G) are also derived.
منابع مشابه
Packing and Domination Invariants on Cartesian Products and Direct Products
The dual notions of domination and packing in finite simple graphs were first extensively explored by Meir and Moon in [15]. Most of the lower bounds for the domination number of a nontrivial Cartesian product involve the 2-packing, or closed neighborhood packing, number of the factors. In addition, the domination number of any graph is at least as large as its 2-packing number, and the invaria...
متن کاملA survey on graphs which have equal domination and closed neighborhood packing numbers
Vizing’s conjecture on the Cartesian product G H of two graphs, γ(G H) ≥ γ(G)γ(H), will hold for all graphs G if the domination and (closed neighborhood) packing number of G are equal. By using the theory of integer programming, we state known sufficient conditions for when the packing number and the domination number of a graph are equal. We also give a sufficient condition using the theory of...
متن کاملOn the Excluded Minors for the Matroids That Are Either Binary or Ternary
The classes of binary and ternary matroids are both relatively well understood as is their intersection, the class of regular matroids. This paper considers the union M of the classes of binary and ternary matroids. M is a minor-closed class and the focus of the paper is on determining its set of excluded minors. It is conjectured here that this set of excluded minors unique matroids that are o...
متن کاملTotal Domination Number of Cartesian Product Networks
Let denote the Cartesian product of graphs and A total dominating set of with no isolated vertex is a set of vertices of such that every vertex is adjacent to a vertex in The total domination number of is the minimum cardinality of a total dominating set. In this paper, we give a new lower bound of total domination number of using parameters total domination, packing and -domination numbers of ...
متن کاملPacking directed circuits exactly
Graphs and digraphs in this paper may have loops and multiple edges. Paths and circuits have no “repeated” vertices, and in digraphs they are directed. A transversal in a digraph D is a set of vertices T which intersects every circuit, i.e. DnT is acyclic. A packing of circuits (or packing for short) is a collection of pairwise (vertex-)disjoint circuits. The cardinality of a minimum transversa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 10 شماره
صفحات -
تاریخ انتشار 2003